منابع مشابه
Time-space Lower Bounds for Satisfiability and Related Problems on Randomized Machines
Computational complexity studies the resources required for computers to solve certain problems; deciding satisfiability of Boolean formulas is one of the most fundamental such problems. This thesis proves lower bounds on the time and memory space required to solve satisfiability and related problems on randomized machines. We establish the first randomized time-space lower bounds for the probl...
متن کاملConditional Lower Bounds for Space/Time Tradeoffs
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-studied hardness assumptions such as 3SUM, APSP, SETH, etc. This line of research helps to obtain a better understanding of the complexity inside P. A ...
متن کاملTime-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n time and n1− space for any > 0 on general random-access nondeterministic Turing machines. In particular, SAT cannot be solved deterministically by a Turing machine using quasilinear time and √ n space. We also give lower bounds for log-space unifo...
متن کاملExtractor-Based Time-Space Lower Bounds for Learning
A matrix M : A×X → {−1, 1} corresponds to the following learning problem: An unknown element x ∈ X is chosen uniformly at random. A learner tries to learn x from a stream of samples, (a1, b1), (a2, b2) . . ., where for every i, ai ∈ A is chosen uniformly at random and bi = M(ai, x). Assume that k, l, r are such that any submatrix of M of at least 2−k · |A| rows and at least 2−l · |X| columns, h...
متن کاملSuper-linear time-space tradeoff lower bounds for randomized computation
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques are an extension of those used by Ajtai 14, 51 in his time-space tradeoffs for deterministic RAM algorithms computing element distinctness and for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2005
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1101821.1101822